Addition-deletion theorem for free hyperplane arrangements and combinatorics

In the theory of hyperplane arrangements, most important and difficult problem is combinatorial dependency several properties. this article, we prove that Terao's celebrated addition theorem for free arrangements combinatorial. Combining other developments in these days, can show all addition-deletion framework As a corollary, define new class called additively arrangement hyperplanes, which be constructed from empty by using only theorem. Then conjecture true class. an application, freeness ideal-Shi